Modifying Edges of a Network to Obtain Short Subgroups
نویسندگان
چکیده
This paper considers problems of the following type: We are given an edge weighted graph G = (V;E). It is assumed that each edge e of the given network has an associated function ce that speci es the cost of shortening the edge by a given amount and that there is a budget B on the total reduction cost. The goal is to develop a reduction strategy satisfying the budget constraint so that the total length of a minimum spanning tree in the modi ed network is the smallest possible over all reduction strategies that obey the budget constraint. We show that in general the problem of computing an optimal reduction strategy for modifying the network as above is NP-hard even for simple classes of graphs and linear functions ce. We present the rst polynomial time approximation algorithms for the problem, where the cost functions ce are allowed to be taken from a broad class of functions. We also present improved approximation algorithms for the class of treewidth-bounded graphs when the cost functions are linear. Our results can be extended to obtain approximation algorithms for more general network design problems such as those considered in [GW92, GGP+94].
منابع مشابه
Detecting Overlapping Communities in Social Networks using Deep Learning
In network analysis, a community is typically considered of as a group of nodes with a great density of edges among themselves and a low density of edges relative to other network parts. Detecting a community structure is important in any network analysis task, especially for revealing patterns between specified nodes. There is a variety of approaches presented in the literature for overlapping...
متن کاملEstimation of Network Reliability for a Fully Connected Network with Unreliable Nodes and Unreliable Edges using Neuro Optimization
In this paper it is tried to estimate the reliability of a fully connected network of some unreliable nodes and unreliable connections (edges) between them. The proliferation of electronic messaging has been witnessed during the last few years. The acute problem of node failure and connection failure is frequently encountered in communication through various types of networks. We know that a ne...
متن کاملGroups with one conjugacy class of non-normal subgroups - a short proof
For a finite group $G$ let $nu(G)$ denote the number of conjugacy classes of non-normal subgroups of $G$. We give a short proof of a theorem of Brandl, which classifies finite groups with $nu(G)=1$.
متن کاملUsing an Evaluator Fixed Structure Learning Automata in Sampling of Social Networks
Social networks are streaming, diverse and include a wide range of edges so that continuously evolves over time and formed by the activities among users (such as tweets, emails, etc.), where each activity among its users, adds an edge to the network graph. Despite their popularities, the dynamicity and large size of most social networks make it difficult or impossible to study the entire networ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996